Some remarks on sign-balanced and maj-balanced posets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Remarks on Sign-Balanced and Maj-Balanced Posets

Let P be an n-element poset (partially ordered set), and let ω : P → [n] = {1, 2, . . . , n} be a bijection, called a labeling of P . We call the pair (P, ω) a labelled poset. A linear extension of P is an order-preserving bijection f : P → [n]. We can regard f as defining a permutation π = π(f) of the set [n] given by π(i) = j if f(ω(j)) = i. We write π in the customary way as a word a1a2 · · ...

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

remarks on distance-balanced graphs

distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.

متن کامل

Remarks on Orthogonal Polynomials and Balanced Realizations

Given a proper antistable rational transfer function g, a balanced realization of g is constructed as a matrix representation of the abstract shift realization introduced by Fuhrmann (1976). The required basis is constructed as a union of sets of polynomials orthogonal with respect to weights given by the squares of the absolute values of minimal degree Schmidt vectors of the corresponding Hank...

متن کامل

Remarks on Balanced Incomplete Block Designs

Proof. Assume the hypothesis and the falsity of either conclusion. Construct matrix A of 2x + 2 rows and 4x+4 columns, with entries + 1 and — 1. The first column contains exclusively +1, and the second column — 1. Set up one-to-one correspondences between rows of A and elements of D ; between columns other than the first two of A and blocks of D. Enter +1 if the element is contained in the bloc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2005

ISSN: 0196-8858

DOI: 10.1016/j.aam.2003.12.002